import os
import sys
import math
from collections import deque, defaultdict
import bisect
import heapq
input = sys.stdin.readline
def multiple():
a = map(int, input().split())
return a
def array():
a = input().split()
return a
def intarray():
a = list(map(int, input().split()))
return a
def intinput():
n = int(input())
return n
def strinput():
s = input().strip()
return s
def isPrime(n):
val = int(math.sqrt(n)) + 1
for i in range(2, val):
if n % i == 0:
return False
return True
def solution():
MOD = 1000000007
n = intinput()
arr=[]
for i in range(n):
a,b = multiple()
arr.append([a,b])
arr.sort()
maxsofar = 0
for i in range(n):
a,b = arr[i]
if b <= maxsofar:
print("Happy Alex")
return
maxsofar = b
print("Poor Alex")
return
t = 1
for _ in range(t):
solution()
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
pair<int,int> pr[n];
for(int i=0;i<n;i++)
{
cin>>pr[i].first>>pr[i].second;
}
sort(pr,pr+n);
for(int j=0;j<n-1;j++)
{
if(pr[j].first<pr[j+1].first && pr[j].second>pr[j+1].second)
{
cout<<"Happy Alex"<<endl;
return 0;
}
}
cout<<"Poor Alex"<<endl;
return 0;
}
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |